public class ComputeFact
{
   /**
      A method to compute n factorial (n!) recursively
      @param n a number >= 0
      @return the value of n!
   */
   public static int factorial(int n)
   {
      // your work here 
      int t = 1;
      for(int i=1;i<=n;i++){
         t*=i;
      }
      return t;
   }
}